منابع مشابه
Simplotopal maps and necklace splitting
We show how to prove combinatorially the Splitting Necklace Theorem by Alon for any number of thieves. Such a proof requires developing a combinatorial theory for abstract simplotopal complexes and simplotopal maps, which generalizes the theory of abstract simplicial complexes and abstract simplicial maps. Notions like orientation, subdivision, and chain maps are defined combinatorially, withou...
متن کاملA Random Necklace Model
We consider a Laplace operator on a random graph consisting of infinitely many loops joined symmetrically by intervals of unit length. The arc lengths of the loops are considered to be independent, identically distributed random variables. The integrated density of states of this Laplace operator is shown to have discontinuities provided that the distribution of arc lengths of the loops has a n...
متن کاملA Carbon Nanofilament-Bead Necklace
Li Song,*,† Alexander W. Holleitner,‡ Huihong Qian,§ Achim Hartschuh,§ Markus Döblinger,§ Eva M. Weig,† and Jörg P. Kotthaus† Center for NanoScience (CeNS) und Fakultät für Physik, Ludwig-Maximilians-UniVersität, Geschwister-Scholl-Platz 1, 80539 Munich, Germany, Walter Schottky Institut (WSI), Technische UniVersität München, Am Coulombwall 3, 85748 Munich, Germany, and Department Chemie und Bi...
متن کاملNecklace-ring vector solitons.
We introduce novel classes of optical vector solitons that consist of incoherently coupled self-trapped "necklace" beams carrying zero, integer, and even fractional angular momentum. Because of the stabilizing mutual attraction between the components, such stationary localized structures exhibit quasistable propagation for much larger distances than the corresponding scalar vortex solitons and ...
متن کاملSolving Necklace Constraint Problems
Some constraint problems have a combinatorial structure where the constraints allow the sequence of variables to be rotated (necklaces), if not also the domain values to be permuted (unlabelled necklaces), without getting an essentially different solution. We bring together the fields of combinatorial enumeration, where efficient algorithms have been designed for (special cases of) some of thes...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Visualization and Computer Graphics
سال: 2010
ISSN: 1077-2626
DOI: 10.1109/tvcg.2010.180